The solutions of two star-height problems for regular trees
نویسندگان
چکیده
منابع مشابه
The solution of two star height problems for regular trees
Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., we show how to construct a rational expression of minimal star-height from the minimal graph of the given tree (i.e., the analogue of the minimal deterministic automaton for regular languages). In one case, the minimal starheight is the rank (in the Sense of Eggan) of the...
متن کاملOn the star height of unary regular behaviours
We prove that for each integer n there is a regular expression over a singleton alphabet which is not bisimilar to any regular expression of star height less than n, thus positively answering a long-standing question of Robin Milner.
متن کاملSpanning Star Trees in Regular Graphs
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If S(W ) is a tree containing all the vertices of G, then we call it a spanning star tree of G. In this case W forms a weakly connected but strongly acyclic dominating set for G. We prove that fo...
متن کاملthe evaluation and comparison of two esp textbooks available on the iranian market for teaching english to the students of medicine
abstract this study evaluated and compared medical terminology and english for the students of medicine (ii) as two representatives of the textbooks available on the iranian market for teaching english to the students of medicine. this research was performed on the basis of a teacher’s and a number of students’ attitudes and the students’ needs analysis for two reasons: first, to investigate...
15 صفحه اولOn the Average Height of b-Balanced Ordered Trees
An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90063-x